On Optimal Coordinated Search Technique to Find a Randomly Located Target

Periodic Optimal Search Control for a Target Appearing Randomly

This paper investigates an optimal search problem under the assumption that a target to be found appears randomly and stays for a fixed time interval. We first formulate the search problem as an optimization problem to maximize the probability of finding the target while reducing the control energy consumption, and provide a solution to this problem. In this paper, we moreover derive the expect...

Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle

In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSS) and Minimally Unsatisfiable Subformulas (MUS) of sets of Boolean clauses is introduced. The approach improves the currently most efficient complete technique in several ways. It makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhaustive a...

Optimal Whereabouts Search for a Moving Target

Combining Akaike’s Information Criterion (AIC) and the Golden-Section Search Technique to find Optimal Numbers of K-Nearest Neighbors

K-nearest neighbor (KNN) is one of the accepted classification tool . Classfication is one of the foremost machine-learning tools used in field of medical data mining. However, one of the most complicated tasks in developing a KNN is determining the optimal number of nearest neighbors, which is usually obtained by repeated experiments for different values of K, till the minimum error rate is ac...

P14: How to Find a Talent?

Talents may be artistic or technical, mental or physical, personal or social. You can be a talented introvert or a talented extrovert. Learning to look for your talents in the right places and building those talents into skills and abilities might take some work, but going about it creatively will let you explore your natural abilities and find your innate talents. You’re not going to fin...